Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
نویسندگان
چکیده
We consider intermediate predicate logics defined by fixed well-ordered (or dually well-ordered) linear Kripke frames with constant domains where the order-type of the well-order is strictly smaller than ω. We show that two such logics of different order-type are separated by a first-order sentence using only one monadic predicate symbol. Previous results by Minari, Takano and Ono, as well as the second author, obtained the same separation but relied on the use of predicate symbols of unbounded arity.
منابع مشابه
Expressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degree
In this thesis we study the expressive power of variants of monadic second-order logic (MSO) on infinite trees by means of automata. In particular we are interested in weak MSO and well-founded MSO, where the second-order quantifiers range respectively over finite sets and over subsets of well-founded trees. On finitely branching trees, weak and well-founded MSO have the same expressive power a...
متن کاملPredicate Introduction Under Stable and Well-Founded Semantics
This paper studies the tranformation of “predicate introduction”: replacing a complex formula in an existing logic program by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imposed by certai...
متن کاملA Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus
We provide a characterization theorem, in the style of van Benthem and Janin-Walukiewicz, for the alternation-free fragment of the modal μ-calculus. For this purpose we introduce a variant of standard monadic second-order logic (MSO), which we call well-founded monadic second-order logic (WFMSO). When interpreted in a tree model, the second-order quantifiers of WFMSO range over subsets of conve...
متن کاملPredicate Introduction for Logics with Fixpoint Semantics. Part II: Autoepistemic Logic
We study the transformation of “predicate introduction” in non-monotonic logics. By this, we mean the act of replacing a complex formula by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imp...
متن کاملPredicate Introduction for Logics with a Fixpoint Semantics. Part I: Logic Programming
We study the transformation of “predicate introduction” in non-monotonic logics. By this, we mean the act of replacing a complex formula by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 25 شماره
صفحات -
تاریخ انتشار 2015